Summarization Attack via Paraphrasing (Student Abstract)
نویسندگان
چکیده
Many natural language processing models are perceived to be fragile on adversarial attacks. Recent work attack has demonstrated a high success rate sentiment analysis as well classification models. However, attacks summarization have not been studied. Summarization tasks rarely influenced by word substitution, since advanced abstractive summary utilize sentence level information. In this paper, we propose paraphrasing-based method We first rank the sentences in document according their impacts summarization. Then, apply paraphrasing procedure generate samples. Finally, test our algorithm benchmarks datasets against others methods. Our approach achieved highest and lowest substitution rate. addition, samples semantic similarity with original sentences.
منابع مشابه
Semantic Parsing via Paraphrasing
A central challenge in semantic parsing is handling the myriad ways in which knowledge base predicates can be expressed. Traditionally, semantic parsers are trained primarily from text paired with knowledge base information. Our goal is to exploit the much larger amounts of raw text not tied to any knowledge base. In this paper, we turn semantic parsing on its head. Given an input utterance, we...
متن کاملImproving Translation via Targeted Paraphrasing
Targeted paraphrasing is a new approach to the problem of obtaining cost-effective, reasonable quality translation that makes use of simple and inexpensive human computations by monolingual speakers in combination with machine translation. The key insight behind the process is that it is possible to spot likely translation errors with only monolingual knowledge of the target language, and it is...
متن کاملSimulation Summarization: (Extended Abstract)
As increasingly large-scale multiagent simulations are being implemented, new methods are becoming necessary for concisely summarizing the results of a simulation run. Here we pose this as the problem of simulation summarization: how to extract the causally-relevant states from the trajectories of the agents. We present a simple algorithm to compress agent trajectories through state space by id...
متن کاملSimplification of Patent Claim Sentences for their Paraphrasing and Summarization
We present an approach to patent claim simplification which segments claim sentences into clausal discourse units, transforms them into complete sentences, establishes coreference relations and builds a discourse structure between discourse units. The four stages are necessary to allow for the syntactic analysis of otherwise unparsable claim sentences and their regeneration using discourse stru...
متن کاملLoop Summarization Using Abstract Transformers
Existing program analysis tools that implement abstraction rely on saturating procedures to compute over-approximations of fixpoints. As an alternative, we propose a new algorithm to compute an over-approximation of the set of reachable states of a program by replacing loops in the control flow graph by their abstract transformer. Our technique is able to generate diagnostic information in case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i13.26985